The capacitated lot-sizing and energy efficient single machine scheduling problem with sequence dependent setup times and costs in a closed-loop supply chain network

نویسندگان

چکیده

In this paper, the capacitated lot-sizing and scheduling problem with sequence dependent setup times costs in a closed loop supply chain is addressed. The system utilizes closed-loop strategy so that multi-class single-level products are produced through both manufacturing of raw materials remanufacturing returned recovered products. system, single machine limited capacity each time period used to perform operations. sequence-dependent (both between two lots different classes belonging same class methods) considered. A large-bucket mixed integer programming formulation proposed for problem. This model minimizes not only costs, inventory holding backlogging over planning horizon, but also energy paid utilization compression processing times. Since NP-hard, matheuristic grey wolf optimization algorithm solve it. To evaluate efficiency algorithm, some experimental instances generated solved. obtained results show effectiveness algorithms.

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Lot sizing and scheduling with sequence-dependent setup costs and times and efficient rescheduling opportunities

This paper deals with lot sizing and scheduling for a single-stage, single-machine production system where setup costs and times are sequence dependent. A large-bucket mixed integer programming (MIP) model is formulated which considers only e$cient sequences. A tailor-made enumeration method of the branch-and-bound type solves problem instances optimally and e$ciently. The size of solvable case...

متن کامل

A two-stage heuristic for single machine capacitated lot-sizing and scheduling with sequence-dependent setup costs

This paper considers a single machine capacitated lot-sizing and scheduling problem. The problem is to determine the lot sizes and the sequence of lots while satisfying the demand requirements and the machine capacity in each period of a planning horizon. In particular, we consider sequence-dependent setup costs that depend on the type of the lot just completed and on the lot to be processed. T...

متن کامل

A Capacitated Lot Sizing Problem with Stochastic Setup Times

In this paper, we study a Capacitated Lot Sizing Problem with Stochastic Setup Times (CLSP-SST).We describe a mathematical model that considers both regular costs (including production, setup and inventory holding costs) and expected overtime costs (related to the excess usage of capacity). The CLSP-SST is formulated as a two-stage stochastic programming problem. A procedure is proposed to effe...

متن کامل

Lot sizing and scheduling with sequence-dependent setup costs and times and e$cient rescheduling opportunities

This paper deals with lot sizing and scheduling for a single-stage, single-machine production system where setup costs and times are sequence dependent. A large-bucket mixed integer programming (MIP) model is formulated which considers only e$cient sequences. A tailor-made enumeration method of the branch-and-bound type solves problem instances optimally and e$ciently. The size of solvable case...

متن کامل

Lot Sizing and Scheduling with Sequence Dependent Setup Costs and times and Eecient Rescheduling Opportunities

1 Summary: This paper deals with lot sizing and scheduling for a single-stage production system where setup costs and times are sequence dependent. A large bucket mixed integer programming (MIP) model is formulated which considers only eecient sequences. A tailor-made enumeration method of the branch-and-bound type solves problem instances optimally and eeciently. Furthermore, it will become cl...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Annals of Operations Research

سال: 2022

ISSN: ['1572-9338', '0254-5330']

DOI: https://doi.org/10.1007/s10479-022-04783-4